Diophantine Triples and k-Generalized Fibonacci Sequences

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diophantine Triples with Values in the Sequences of Fibonacci and Lucas Numbers

Let FL = {1, 2, 3, 4, 5, 7, 8, 11, 13, 18, 21, . . .} be the set consisting of all Fibonacci and Lucas numbers with positive subscripts. We find all triples (a, b, c) of positive integers a < b < c such that ab + 1, ac+ 1, bc+ 1 are all members of FL.

متن کامل

A Generalized Fibonacci Sequence and the Diophantine Equations $x^2pm kxy-y^2pm x=0$

In this paper some properties of a generalization of Fibonacci sequence are investigated. Then we solve the Diophantine equations $x^2pmkxy-y^2pm x=0$, where $k$ is positive integer, and describe the structure of solutions.

متن کامل

On Periodic ∞-generalized Fibonacci Sequences

The notion of an∞-generalized Fibonacci sequence has been introduced in [6], and studied in [1], [7], [9]. This class of sequences defined by linear recurrences of infinite order is an extension of the class of ordinary (weighted) r-generalized Fibonacci sequences (r-GFS, for short) with r finite defined by linear recurrences of r order (for example, see [2], [3], [4], [5], [8] etc.) More preci...

متن کامل

Generalized (k, r)–Fibonacci Numbers

In this paper, and from the definition of a distance between numbers by a recurrence relation, new kinds of k–Fibonacci numbers are obtained. But these sequences differ among themselves not only by the value of the natural number k but also according to the value of a new parameter r involved in the definition of this distance. Finally, various properties of these numbers are studied.

متن کامل

Restricted Permutations, Fibonacci Numbers, and k-generalized Fibonacci Numbers

In 1985 Simion and Schmidt showed that the number of permutations in Sn which avoid 132, 213, and 123 is equal to the Fibonacci number Fn+1. We use generating function and bijective techniques to give other sets of pattern-avoiding permutations which can be enumerated in terms of Fibonacci or k-generalized Fibonacci numbers.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the Malaysian Mathematical Sciences Society

سال: 2016

ISSN: 0126-6705,2180-4206

DOI: 10.1007/s40840-016-0405-4